A Logical Formalization of Hardware Design Diagrams
نویسنده
چکیده
Diagrams have been left as an informal tool in hardware reasoning, thus rendering them unacceptable representations within formal reasoning systems. We demonstrate some advantages of formally supporting diagrams in hardware veri cation systems via a simple example and provide a logical formalization of hardware diagrams upon which we are constructing a veri cation tool.
منابع مشابه
Extended Timing Diagrams as a Speci cation Language
Hardware designs increasingly evolve to distributed systems composed of multiple interacting components working in parallel. Extended Timing Diagrams presented in this paper are an intelligible graphical speci cation language especially suited for the description of such communicating systems. The formal semantics of extended timing diagrams is de ned in terms of a process calculus. This formal...
متن کاملTwo Types of Diagrammatic Inference Systems: Relation-based System as Natural Deduction and Region-based System as Resolution
Since the 1990s, reasoning with Venn and Euler diagrams has been studied from mathematical and logical viewpoints. The standard approach to a formalization is a “regionbased” approach, where a diagram is defined as a set of regions. An alternative is a “relation-based” approach, where a diagram is defined in terms of topological relations (inclusion and exclusion) between circles and points. In...
متن کاملDesigning a logical data model of athletes' hospital information management system based on international standards
Background and purpose: Today, hospital care, relying on the health record system, has received more attention than before. Considering the diversity of data in these systems, the design of standard conceptual and logical models by service providers will play an important role in their success. Therefore, this research was conducted with the aim of designing a logical data model of the hospital...
متن کاملTiming Diagrams: Formalization and Algorithmic Verification
Timing diagrams are popular in hardware design. They have been formalized for use in reasoning tasks, such as computer-aided veriication. These eeorts have largely treated timing diagrams as interfaces to established notations for which veriication is decidable; this has restricted timing diagrams to expressing only regular language properties. This paper presents a timing diagram logic capable...
متن کاملCertifying Confluence Proofs via Relative Termination and Rule Labeling
The rule labeling heuristic aims to establish confluence of (left-)linear term rewrite systems via decreasing diagrams. We present a formalization of a confluence criterion based on the interplay of relative termination and the rule labeling in the theorem prover Isabelle. Moreover, we report on the integration of this result into the certifier CeTA, facilitating the checking of confluence cert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994